Location:
Search - dijkstra single
Search list
Description: 图论算法库 C++ 语言实现
代码内容 图论算法库，包括以下算法：
单源最短路径 Dijkstra 算法
单源最短路径 Bellman-Ford 算法
最小生成树 Prim 算法
每对节点间最短路径 Flod-Warshall 算法
语言 C++
编译平台 VisualAge C++ 4.0
作者 starfish (starfish.h@china.com)
备注 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。
该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。 虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 -graph algorithm for C language code content graph algorithm library, including the following algorithm : single-source shortest path algorithm Dijkstra single source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod - Warshall ALGOL C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, the VisualAge C 4.0 debugging through. The compressed file contains all Graph.h the library, the procedure call interface, see the Notes. Other documents algorithm is used to test the test procedures in VisualAge C compiler running under 4.0. The algorithm is for me to participate in ACM / Illinois prepared to contest the information, because the competition for high speed
Platform: |
Size: 10202 |
Author: 罗鹏魁 |
Hits:
Description: 单源点最短路径贪心算法：用到Dijkstra算法，-single source shortest path greedy algorithm : use Dijkstra algorithm,
Platform: |
Size: 1024 |
Author: 刘兰英 |
Hits:
Description: 图论算法库 C++ 语言实现
代码内容 图论算法库，包括以下算法：
单源最短路径 Dijkstra 算法
单源最短路径 Bellman-Ford 算法
最小生成树 Prim 算法
每对节点间最短路径 Flod-Warshall 算法
语言 C++
编译平台 VisualAge C++ 4.0
作者 starfish (starfish.h@china.com)
备注 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。
该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。 虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 -graph algorithm for C language code content graph algorithm library, including the following algorithm : single-source shortest path algorithm Dijkstra single source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod- Warshall ALGOL C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, the VisualAge C 4.0 debugging through. The compressed file contains all Graph.h the library, the procedure call interface, see the Notes. Other documents algorithm is used to test the test procedures in VisualAge C compiler running under 4.0. The algorithm is for me to participate in ACM/Illinois prepared to contest the information, because the competition for high speed
Platform: |
Size: 10240 |
Author: 罗鹏魁 |
Hits:
Description: 完整实现了单源最短路径的算法。
采用的是贪心算法思想。-integrity to achieve a single-source shortest path algorithm. The greedy algorithm.
Platform: |
Size: 7168 |
Author: jackson |
Hits:
Description: 图论算法库 C++ 语言实现 代码内容 图论算法库，包括以下算法： 单源最短路径 Dijkstra 算法 单源最短路径 Bellman-Ford 算法 最小生成树 Prim 算法 每对节点间最短路径 Flod-Warshall 算法 语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。 该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。 虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 - -graph theory is the C language code as graph theory algorithm library, including the following algorithm : single source Dijkstra shortest path algorithm for single-source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod- Warshall algorithm language C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, VisualAge C 4.0 debugging through. The compressed file contains Graph.h all library functions, procedures call interface see Notes. Other documents are used to test the algorithm testing procedures, the VisualAge C compiler running under 4.0. The algorithm is to participate in the ACM/ICPC contest and the preparation of information, because the competit
Platform: |
Size: 4096 |
Author: |
Hits:
Description: 单源点最短路径算法
* 本程序用来实现单源点最短路径（E.Dijkstra）算法
* 在Turbo C2.0编译器下编译通过
* 算法过程中
* 每条边的两个顶点和权值由用户输入，格式：1 2 20
* 程序默认源点为第一个顶点
* 算法完成后输出路径长度和路径上的顶点
* 格式为：路径长度：目标顶点<-经过的顶点...<-源点-Single-source shortest path algorithm* This procedure used to realize single-source shortest path (E. Dijkstra) algorithm* The Turbo C2.0 compiler algorithm under the compiler through the process of** each of the two vertex and edge weights by user input, format: 1 2 20* default source for the first vertex* algorithm output after the completion of the path length and path of the vertex* format: path length: Target Vertex
Platform: |
Size: 1024 |
Author: zhoutianshu |
Hits:
Description: 单源点最短路径的算法
dijkstra的经典算法-Single-source shortest path algorithm Dijkstra s classic algorithm
Platform: |
Size: 65536 |
Author: navylq |
Hits:
Description: 单源最短路径问题的一种求解算法－Dijkstra算法-Single-source shortest path algorithm A-Dijkstra algorithm
Platform: |
Size: 1024 |
Author: 王振兴 |
Hits:
Description: 单源最短路径Dijkstra算法.rar-Single-source shortest path Dijkstra algorithm. Rar
Platform: |
Size: 156672 |
Author: sandra |
Hits:
Description: Dijkstra 贪心法求单源最短路径.Dijkstra算法是解单源最短路径问题的一个贪心算法。-Dijkstra greedy method for single-source shortest path. Dijkstra algorithm is the solution of single-source shortest path problem, a greedy algorithm.
Platform: |
Size: 2048 |
Author: 胡少龙 |
Hits:
Description: 求单源最短路径(要求用Dijkstra算法求得）-For single-source shortest path (Dijkstra algorithm requires obtained)
Platform: |
Size: 1024 |
Author: lifuyuan |
Hits:
Description: 单源最短路径问题：给定带权有向图G=(V,E)。给定V中的一个顶点v，称为源。要计算从源到所有其它各顶点的最短路径长度。-Single-source shortest path problem: a given weighted directed graph G = (V, E). Given a vertex V in v, known as the source. To calculate from the source to all other vertices of the shortest path length.
Platform: |
Size: 1024 |
Author: 忠波 |
Hits:
Description: Dijktra s single source shortest path algorithm. The function takes a graph (which may be sparse) as an input and returns the matrix of shortest distances between all of the nodes. Additionally, individual source and sink nodes may be specified as additional arguments.
Platform: |
Size: 1024 |
Author: ruso |
Hits:
Description: 计算机算法设计与分析(第3版).王晓东编著.电子工业出版社\第4章 贪心算法\4.5 单源最短路径\Dijkstra-Single Source Shortest Path
Platform: |
Size: 8192 |
Author: dirdir |
Hits:
Description: 基于dijkstra的单源节点的最短路径算法的代码实现-Implemented based on of dijkstra single-source nodes of the shortest path algorithm code
Platform: |
Size: 1078272 |
Author: 王 |
Hits:
Description: 利用Fibonacci堆和Binomial堆实现Dijkstra单源最短路径算法-implement Dijkstra Single Source Shortest Path using Fibonacci heap, and Binomial heap
Platform: |
Size: 8192 |
Author: Min Chen |
Hits:
Description: 数据结构中dijkstra单源最短路径算法-dijkstra single-source shortest path algorithm
Platform: |
Size: 1024 |
Author: 杨将 |
Hits:
Description: C++实现贪心算法 Dijkstra 单源最短路径-C++ greedy algorithm of Dijkstra single source shortest path
Platform: |
Size: 1024 |
Author: 学吧 |
Hits:
Description: Dijkstra算法(单源最短路径) 单源最短路径问题,即在图中求出给定顶点到其它任一顶点的最短路径。-Algorithm (single-source shortest path) Dijkstra,single-source shortest path problem, namely to obtain a given vertex to any other vertex of the shortest path in the graph.
Platform: |
Size: 4769792 |
Author: zz |
Hits:
Description: dijkstra 单源最短路径算法，用于计算一个节点到其他所有节点的最短路径(A single source shortest path algorithm is used to compute the shortest path from one node to all other nodes)
Platform: |
Size: 278528 |
Author: kidding_
|
Hits: